By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 28, Issue 6, pp. 1923-2299

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Tree Data Structures for N-Body Simulation

Richard J. Anderson

pp. 1923-1940

BibTeX  Abstract Full Text:  PDF

The Power of Vacillation in Language Learning

John Case

pp. 1941-1969

BibTeX  Abstract Full Text:  PDF

An Associative Block Design ABD(8,5)

A. E. Brouwer

pp. 1970-1971

BibTeX  Abstract Full Text:  PDF

On the Robustness of Functional Equations

Ronitt Rubinfeld

pp. 1972-1997

BibTeX  Abstract Full Text:  PDF

New Results on the Old k-opt Algorithm for the Traveling Salesman Problem

Barun Chandra, Howard Karloff, and Craig Tovey

pp. 1998-2029

BibTeX  Abstract Full Text:  PDF

Parallel Complexity of Numerically Accurate Linear System Solvers

Mauro Leoncini, Giovanni Manzini, and Luciano Margara

pp. 2030-2058

BibTeX  Abstract Full Text:  PDF

Approximate Complex Polynomial Evaluation in Near Constant Work Per Point

John H. Reif

pp. 2059-2089

BibTeX  Abstract Full Text:  PDF

Optimal Search in Trees

Yosi Ben-Asher, Eitan Farchi, and Ilan Newman

pp. 2090-2102

BibTeX  Abstract Full Text:  PDF

Weak Random Sources, Hitting Sets, and BPP Simulations

Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, and Luca Trevisan

pp. 2103-2116

BibTeX  Abstract Full Text:  PDF

Dominators in Linear Time

Stephen Alstrup, Dov Harel, Peter W. Lauridsen, and Mikkel Thorup

pp. 2117-2132

BibTeX  Abstract Full Text:  PDF

Approximating Capacitated Routing and Delivery Problems

Prasad Chalasani and Rajeev Motwani

pp. 2133-2149

BibTeX  Abstract Full Text:  PDF

On Floor-Plan of Plane Graphs

Xin He

pp. 2150-2167

BibTeX  Abstract Full Text:  PDF

Horn Extensions of a Partially Defined Boolean Function

Kazuhisa Makino, Ken-ichi Hatanaka, and Toshihide Ibaraki

pp. 2168-2186

BibTeX  Abstract Full Text:  PDF

Fast Approximate Graph Partitioning Algorithms

Guy Even, Joseph (Seffi) Naor, Satish Rao, and Baruch Schieber

pp. 2187-2214

BibTeX  Abstract Full Text:  PDF

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

John Hershberger and Subhash Suri

pp. 2215-2256

BibTeX  Abstract Full Text:  PDF

Tight Lower Bounds for st-Connectivity on the NNJAG Model

Jeff Edmonds, Chung Keung Poon, and Dimitris Achlioptas

pp. 2257-2284

BibTeX  Abstract Full Text:  PDF

Computing Two-Dimensional Integer Hulls

Warwick Harvey

pp. 2285-2299

BibTeX  Abstract Full Text:  PDF